| 1. | This is a combinatorial problem in canonical form .
这是组合论中的典型问题。 |
| 2. | Inter - relations among collaborative discussion , meta - cognitive control and successful solution in combinatorial problem
合作讨论和元认知监控与排列组合问题的解决 |
| 3. | Adleman , l . m . " molecular computation of solutions to combinatorial problems . " science 266 ( 5187 ) ( 11 nov 1994 ) : 1021 - 4
组合问题的分子运算解决方法. " 。期刊科学第266卷。第1024到1024页。 |
| 4. | This paper presents the mathematical model and the general algorithms of transforming combinatorial problem into state space search
本文提出了将组合问题归结为状态空间搜索问题的数学模型和通用算法。 |
| 5. | Because the design of state space of the combinatorial problem is much easier than design of the searching algorithm , the present of the general searching algorithm is the apparent progress for the searching technology
因为组合问题的状态空间表示比原来的搜索求解容易的多，通用搜索算法的提出是搜索技术的一个明显的进步。 |
| 6. | Supposed algorithm b is the concrete searching algorithm for the combinatorial problem p . the parameter of algorithm a corresponding to algorithm b is the algorithm that denotes the combinatorial problem p in the way of the state space
设b是求解组合问题p的具体搜索算法，算法a对应于算法b的参数就是用状态空间表示组合问题p的算法。 |
| 7. | The program of state space to solve one combinatorial problem is made up of the general searching module and one module of material problem . the different material problems have different modules , but the general searching module does not vary with the problems
一个组合问题的状态空间求解程序由通用搜索模块加上一个问题描述模块组成，不同问题具有不同的问题描述模块，通用搜索模块不随问题的改变而改变。 |
| 8. | Problem c and problem d are also dual . they have a dual property that there are at least three " critical points " corresponding to an optimal straight - line in problem c and there are at least three " critical straight - lines " corre - sponding to an optimal point in problem d . from these properties , these four non - linear prob - lems could be transformed into combinatorial problems and could be solved by algorithms with polynomial - time iterations
问题c和问题d也是对偶问题。问题c和问题d也有很好的对偶性质：在问题c中，对应于一条最优直线，至少存在三个“临界点” ；在问题d中，对应于一个最优点，至少存在三条“临界直线” 。基于这种性质，这四个非线性优化问题便转化为组合问题，从而得到迭代次数为多项式的算法。 |
| 9. | The algorithm is based on the breadth - first search and optimized by ant algorithm . ants system is an artificial system based on the behavior of real ant colonies , which is often used to solve combinatorial problems , such as traveling salesman problem ( tsp ) . in ant colony system ( acs ) , a set of cooperating agents called ants cooperate to find good solutions to tsp
本算法基于宽度优先并用蚂蚁算法优化，蚂蚁算法是一种基于真实蚁群的人工智能系统，常用于解决组合优化问题，如旅行商问题( tsp ) ，在蚂蚁算法中一组蚂蚁团结合作，寻找tsp问题的最优解。 |
| 10. | Until now , this type of combinatorial problems are usually solved by linear programming , interger programming , analytical methods , heuristic methods and so on . but these methods have many disadvantages such as . low searching efficiency , converging slowly , converging to local optimization solution easily and not converging
本文针对目前对接入网优化存在着缺乏有效算法的现状，确定了采用高效的启发式搜索算法? ?遗传算法作为优化算法，着重解决了遗传算子的设计和实现问题，并对算法进行了改进，取得了很好的效果。 |
